Distributed Heuristic Forward Search for Multi-agent Planning
نویسندگان
چکیده
منابع مشابه
Distributed Heuristic Forward Search for Multi-agent Planning
This paper deals with the problem of classical planning for multiple cooperative agents who have private information about their local state and capabilities they do not want to reveal. Two main approaches have recently been proposed to solve this type of problem – one is based on reduction to distributed constraint satisfaction, and the other on partial-order planning techniques. In classical ...
متن کاملDistributed Heuristic Forward Search for Multi-Agent Systems
This paper describes a number of distributed forward search algorithms for solving multi-agent planning problems. We introduce a distributed formulation of non-optimal forward search, as well as an optimal version, mad-a*. Our algorithms exploit the structure of multi-agent problems to not only distribute the work efficiently among different agents, but also to remove symmetries and reduce the ...
متن کاملTrial-Based Heuristic Tree-search for Distributed Multi-Agent Planning
We present a novel search scheme for privacypreserving multi-agent planning. Inspired by UCT search, the scheme is based on growing an asynchronous search tree by running repeated trials through the tree. We describe key differences to classical multiagent forward search, discuss theoretical properties of the presented approach, and evaluate it based on benchmarks from the CoDMAP competition.
متن کاملConformant Planning via Heuristic Forward Search
Conformant planning is the task of generating plans given uncertainty about the initial state and action effects, and without any sensing capabilities during plan execution. The plan should be successful regardless of which particular initial state we are in. This paper is motivated by the observation that (1) Conformant planning without conditional effects can be handled easily by any forward ...
متن کاملAdmissible Landmark Heuristic for Multi-Agent Planning
Heuristics are a crucial component in modern planning systems. In optimal multiagent planning the state of the art is to compute the heuristic locally using only information available to a single agent. This approach has a major deficiency as the local shortest path can arbitrarily underestimate the true shortest path cost in the global problem. As a solution, we propose a distributed version o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2014
ISSN: 1076-9757
DOI: 10.1613/jair.4295